Approximating MAPs for belief networks is NP-hard and other theorems
نویسندگان
چکیده
منابع مشابه
Approximating MAPs for Belief Networks is NP-Hard and Other Theorems
Finding rna.ximum a posteriori (MAP) assignments, also called Most Probable Explanations, is an important problem on Bayesian belief networks. Shimony has shown that finding MAPS is NPhard. In this paper, we show that approximating MAPS with a constant ratio bound is also NP-hard. In addition. we examine the complexity of two related problems which have been mentioned in the literature. We show...
متن کاملFinding MAPs for Belief Networks is NP-Hard
Given a probabilistic world model, an important problem is to find the maximum a-posteriori probability (MAP) instantiation of all the random variables given the evidence. Numerous researchers using such models employ some graph representation for the distributions, such as a Bayesian belief network. This representation simplifies the complexity of specifying the distributions from exponential ...
متن کاملApproximating MAX-E3LIN is NP-Hard
This lecture focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. In the MAX-E3LIN problem, our input is a series of linear equations (mod 2) in n binary variables, each with three terms. Equivalently, one can think of this as ±1 variables and ternary products. The objective is to maximize the fraction of satisfied equations.
متن کاملApproximating-CVP to Within Almost-Polynomial Factors is NP-Hard
This paper shows the closest vector in a lattice to be NPhard to approximate to within any factor up to 2(logn)1 where = (log logn) c for any constant c < 12 . Introduction A lattice L = L(v1; ::; vn), for vectors v1; ::; vn 2 Rn is the set of all integer linear combinations of v1; ::; vn, that is, L = fP aivi j ai 2 Zg. Given a lattice L and an arbitrary vector y, the Closest Vector Problem (C...
متن کاملApproximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard
Given a real vector =(1; : : : ; d) and a real number " > 0 a good Diophantine approximation to is a number Q such that kQQ mod Zk1 ", where k k1 denotes thè1-norm kxk1 := max 1id jxij for x = (x1; : : : ; x d). Lagarias 12] proved the NP-completeness of the corresponding decision problem, i.e., given a vector 2 Q d , a rational number " > 0 and a number N 2 N+, decide whether there exists a nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1998
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(98)00043-5